The Inverse Eigenvector Problem for Real Tridiagonal Matrices

نویسندگان

  • Beresford N. Parlett
  • Froilán M. Dopico
  • Carla Ferreira
چکیده

A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is presented. With its help we can define necessary and sufficient conditions for the unique real tridiagonal matrix for which an approximate pair of complex eigenvectors are exact. Similarly we can designate the unique real tridiagonal matrix for which two approximate real eigenvectors, with different real eigenvalues, are also exact. We close with an illustration that these unique “backward error” matrices are sensitive to small rounding errors in certain partial sums which play a key role in determining the matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

Inner deflation for symmetric tridiagonal matrices

Suppose that one knows an accurate approximation to an eigenvalue of a real symmetric tridiagonal matrix. A variant of deflation by the Givens rotations is proposed in order to split off the approximated eigenvalue. Such a deflation can be used instead of inverse iteration to compute the corresponding eigenvector. © 2002 Elsevier Science Inc. All rights reserved.

متن کامل

On twisted factorizations of block tridiagonal matrices

Non-symmetric and symmetric twisted block factorizations of block tridiagonal matrices are discussed. In contrast to non-blocked factorizations of this type, localized pivoting strategies can be integrated which improves numerical stability without causing any extra fill-in. Moreover, the application of such factorizations for approximating an eigenvector of a block tridiagonal matrix, given an...

متن کامل

Some inverse eigenproblems for Jacobi and arrow matrices

Ve consider tl1e problem or re<:eH18l.r11dir1g Jacobi rnatric:e8 a.rid real symmetric: arrow ma.I.rices from two cigcnpairs. ,'\lgoritl1rn8 ror solving l.licsc i11vcr8c problem;; are presented. \Ve show that there are rea;;onable condition;;, under which this reconstruction is always possible. }foreover, it is ;;,een that in certain cases reconstruction can proceed with little or no cancellatio...

متن کامل

On deflation for symmetric tridiagonal matrices

K.V. Fernando developed an efficient approach for computation of an eigenvector of a tridiagonal matrix corresponding to an approximate eigenvalue. We supplement Fernando’s method with deflation procedures by Givens rotations. These deflations can be used in the Lanczos process and instead of the inverse iteration.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2016